On a tableau rule for identity.

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rule Refinement for Semantic Tableau Calculi

This paper investigates refinement techniques for semantic tableau calculi. The focus is on techniques to reduce branching in inference rules and thus allow more effective ways of carrying out deductions. We introduce an easy to apply, general principle of atomic rule refinement, which depends on a purely syntactic condition that can be easily verified. The refinement has a wide scope, for exam...

متن کامل

A Tableau Method for Checking Rule Admissibility in S4

Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the modal logic S4. Our method is based on a standard semantic ground tableau approach. In particular, we reduce rule admissibility in S4 to satisfiability of a formula in a logic that extends S4. The extended logic is charac...

متن کامل

Towards a tableau-based procedure for PLTL based on a multi-conclusion rule and logical optimizations

We present an ongoing work on a proof-search procedure for Propositional Linear Temporal Logic (PLTL) based on a one-pass tableau calculus with a multiple-conclusion rule. The procedure exploits logical optimization rules to reduce the proof-search space. We also discuss the performances of a Prolog prototype of our procedure.

متن کامل

A Rule-Based Implementation of Fuzzy Tableau Reasoning

The integration of distinct reasoning styles such as the ones exploited by description logics and rule-based systems is still an open challenge because of the differences among them. Such integration may be achieved by following two complementary approaches: loose integration vs. tight integration. Loosely integrated hybrid systems couple existing tools, so they have to handle mutual interactio...

متن کامل

A Tableau for CTL

We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of computation tree logic CTL*. This is the first such tableau. CTL* is an exceptionally important temporal logic with applications from hardware design to agent reasoning but there is no easy automated reasoning approach to CTL*. The tableau here is a traditional ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1980

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093882951